Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming

نویسندگان

  • Terence Soule
  • James A. Foster
چکیده

Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases parsimony pressure degrades the performance of the genetic program. In this paper we show that poor average results with parsimony pressure are a result of 'failed' populations that overshadow the results of populations that incorporate parsimony pressure successfully. Additionally, we show that the effect of parsimony pressure can be measured by calculating the relationship between program size and performance within the population. This measure can be used as a partial indicator of success or failure for individual populations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

E ects of Code Growth and ParsimonyPressure on Populations in GeneticProgramming

Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases parsimony pressure degrades the performance of the genetic program. In this paper we show that poor average results with parsimony pressure are a result of \failed" populations which overshadow the results of population...

متن کامل

E ects of Code Growth and ParsimonyPressure on Populations in GeneticProgramming Terence

Parsimony pressure has been increasingly used as a means of controling code growth in genetic programming. However, several published papers have shown that in some cases its use can degrade the performance of the genetic program Koza, 1992, Nordin and Banzhaf, 1995]. In this paper we show that poor average results with parsimony pressure are a result of \failed" populations which overshadow th...

متن کامل

Code Growth, Explicitly Defined Introns, and Alternative Selection Schemes

Previous work on introns and code growth in genetic programming is expanded on and tested experimentally. Explicitly defined introns are introduced to tree-based representations as an aid to measuring and evaluating intron behavior. Although it is shown that introns do create code growth, they are not its only cause. Removing introns merely decreases the growth rate; it does not eliminate it. B...

متن کامل

Lexicographic Parsimony Pressure

We introduce a technique called lexicographic parsimony pressure, for controlling the significant growth of genetic programming trees during the course of an evolutionary computation run. Lexicographic parsimony pressure modifies selection to prefer smaller trees only when fitnesses are equal (or equal in rank). This technique is simple to implement and is not affected by specific differences i...

متن کامل

Symbolic regression, parsimony, and some theoretical considerations about GP search space

Universal Consistency, the convergence to the minimum possible error rate in learning through genetic programming (GP), and Code bloat, the excessive increase of code size, are important issues in GP. This paper proposes a theoretical analysis of universal consistency and code bloat in the framework of symbolic regression in GP, from the viewpoint of Statistical Learning Theory, a well grounded...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Evolutionary computation

دوره 6 4  شماره 

صفحات  -

تاریخ انتشار 1998